Stable Matchings for A Generalized Marriage Problem

نویسنده

  • Somdeb Lahiri
چکیده

We show, that a simple generalization of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley (1962), yields outcomes for a generalized marriage problem, which are necessarily stable. We also show, that any outcome of this procedure is Weakly Pareto Optimal for Men, i.e. there is no other outcome which all men prefer to an outcome of this procedure. In a final concluding section of this paper, we consider the problem of choosing a set of multi-party contracts, where each coalition of agents has a non-empty finite set of feasible contracts to choose from. We call such problems, generalized contract choice problems. The model we propose is a generalization of the model due to Shapley and Scarf (1974) called the housing market. We are able to show with the help of a three agent example, that there exists a generalized contract choice problem, which does not admit any stable outcome.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Median Stable Matching for College Admissions

We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings. JEL classification...

متن کامل

Popularity in the Generalized Hospital Residents Setting

We consider the problem of computing popular matchings in a bipartite graph G = (R ∪ H, E) where R and H denote a set of residents and a set of hospitals respectively. Each hospital h has a positive capacity denoting the number of residents that can be matched to h. The residents and the hospitals specify strict preferences over each other. This is the well-studied Hospital Residents (HR) probl...

متن کامل

A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas

Classified stable matching, proposed by Huang, describes a matching model between academic institutes and applicants, where each institute has upper and lower quotas on classes, i.e., subsets of applicants. Huang showed that the problem to decide whether there exists a stable matching or not is NP-hard in general. On the other hand, he showed that the problem is solvable if the classes form a l...

متن کامل

A Fixed-Point Approach to Stable Matchings and Some Applications

We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that links together seemingly distant results, like the stable marriage theorem of Gale and Shapley [11], the Menelsohn-Dulmage theorem [21], the Kundu-Lawler theorem [19], Tarski’s fixed point theorem [32], the Cantor-Bernstein theorem, Pym’s linking theorem [22, 23] or ...

متن کامل

Stable marriages and search frictions

Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market. Towards this end, we embed the standard marriage markets in a search model with random meetings. We study the limit of steady-state equilibria as exogenous frictions vanish. The main result is tha...

متن کامل

Maximum cardinality popular matchings in the stable marriage problem

Popular matching and was extensively studied in recent years as an alternative to stable matchings. Both type of matchings are defined in the framework of Stable Marriage (SM) problem: in a given bipartite graph G = (A,B;E) each vertex u has a strict order of preference on its neighborhood. A matching M is popular, if for every matching M ′ of G, the number of vertices that prefer M ′ to M is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003